Energy/Stress Functions for Dimension Reduction and Graph Drawing: Power Laws and Their Clustering Properties∗

نویسندگان

  • Lisha Chen
  • Andreas Buja
چکیده

We introduce a parametrized family of energy/stress functions useful for proximity analysis, nonlinear dimension reduction, and graph drawing. The functions are inspired by the physics intuitions of attractive and repulsive forces common in graph drawing. Their minimization generates low-dimensional configurations (embeddings, graph drawings) whose interpoint distances match input distances as best as possible. The functions model attractive and repulsive forces with so-called Box-Cox transformations (essentially power transformations with the logarithmic transformation analytically embedded and negative powers made monotone increasing). Attractive and repulsive forces are balanced so as to attempt exact matching of input and output distances. To stabilize embeddings when only local distances are used, we impute infinite non-local distances that exert infinitesimal repulsive forces. The resulting energy/stress functions form a three-parameter family that contains many of the published energy functions in graph drawing and stress functions in multidimensional scaling. The problem of selecting an energy/stress function is therefore translated to a parameter selection problem which can be approached with a meta-criterion previously proposed by the authors (Chen and Buja 2009). Of particular interest is the tuning of a parameter associated with the notion of “clustering strength” proposed by Noack (2003). Such tuning greatly helps identifying “zero-dimensional manifolds”, i.e., clusters.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Local Multidimensional Scaling for Nonlinear Dimension Reduction, Graph Layout and Proximity Analysis

In recent years there has been a resurgence of interest in nonlinear dimension reduction methods. Among new proposals are so-called “Local Linear Embedding” (LLE) and “Isomap”. Both use local neighborhood information to construct a global lowdimensional embedding of a hypothetical manifold near which the data fall. In this paper we introduce a family of new nonlinear dimension reduction methods...

متن کامل

Stress functions for nonlinear dimension reduction, proximity analysis, and graph drawing

Multidimensional scaling (MDS) is the art of reconstructing pointsets (embeddings) from pairwise distance data, and as such it is at the basis of several approaches to nonlinear dimension reduction and manifold learning. At present, MDS lacks a unifying methodology as it consists of a discrete collection of proposals that differ in their optimization criteria, called “stress functions”. To corr...

متن کامل

Analysis of Resting-State fMRI Topological Graph Theory Properties in Methamphetamine Drug Users Applying Box-Counting Fractal Dimension

Introduction: Graph theoretical analysis of functional Magnetic Resonance Imaging (fMRI) data has provided new measures of mapping human brain in vivo. Of all methods to measure the functional connectivity between regions, Linear Correlation (LC) calculation of activity time series of the brain regions as a linear measure is considered the most ubiquitous one. The strength of the dependence obl...

متن کامل

Local Multidimensional Scaling for Nonlinear Dimension Reduction, Graph Drawing and Proximity Analysis

In the past decade there has been a resurgence of interest in nonlinear dimension reduction. Among new proposals are “Local Linear Embedding” (LLE, Roweis and Saul 2000), “Isomap” (Tenenbaum et al. 2000) and Kernel PCA (KPCA, Schölkopf, Smola and Müller 1998), which all construct global lowdimensional embeddings from local affine or metric information. We introduce a competing method called “Lo...

متن کامل

graphTPP: A multivariate based method for interactive graph layout and analysis

Graph layout is the process of creating a visual representation of a graph through a node-link diagram. Node-attribute graphs have additional data stored on the nodes which describe certain properties of the nodes called attributes. Typical force-directed representations often produce hairball-like structures that neither aid in understanding the graph’s topology nor the relationship to its att...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009